Challenge Problems for Artiicial Intelligence

نویسندگان

  • Bart Selman
  • Rodney A. Brooks
  • Tom M. Mitchell
  • Nils J. Nilsson
چکیده

AI textbooks and papers often discuss the big ques tions such as how to reason with uncertainty how to reason e ciently or how to improve performance through learning It is more di cult however to nd descriptions of concrete problems or challenges that are still ambitious and interesting yet not so open ended The goal of this panel is to formulate a set of such challenge problems for the eld Each panelist was asked to formulate one or more challenges The em phasis is on problems for which there is a good chance that they will be resolved within the next ve to ten years A good example of the potential bene t of a con crete AI challenge problem is the recent success of Deep Blue Deep Blue is the result of a research e ort fo cused on a single problem develop a program to defeat the world chess champion Although Deep Blue has not yet quite achieved this goal it played a remark ably strong game against Kasparov in the recent ACM Chess Challenge Match A key lesson we learn from Deep Blue s strength is that e cient brute force search can be much more ef fective than sophisticated heuristically guided search In fact brute force was so successful that it led Kas parov to exclaim I could feel I could smell a new

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Negotiation as a Metaphor for Connict Resolution in Distributed Artiicial Intelligence

Distributed artiicial intelligence (DAI) is concerned with solving problems by applying both artiicial intelligence techniques and multiple problem solvers. One of the critical research issue of cooperative problem solving by groups is the avoidance, detection and resolution of connicts among the participants. The connict management plays the key role in cooperative problem solving e.g. in conc...

متن کامل

Pado: a New Learning Architecture for Object Recognition

Most artiicial intelligence systems today work on simple problems and artiicial domains because they rely on the accurate sensing of the task world. Object recognition is a crucial part of the sensing challenge and machine learning stands in a position to catapult object recognition into real world domains. Given that, to date, machine learning has not delivered general object recognition, we p...

متن کامل

Pado: Learning Tree Structured Algorithms for Orchestration into an Object Recognition System 1

Most artiicial intelligence systems today work on simple problems and artiicial domains because they rely on the accurate sensing of the task world. Object recognition is a crucial part of the sensing challenge and machine learning stands in a position to catapult object recognition into real world domains. Given that, to date, machine learning has not delivered general object recognition, we p...

متن کامل

Symbolic Rules and Neural Networks: AI Back at a Join Point

Artiicial intelligence has always been a controversial eld of research, assaulted from without by philosophers disputing its possibility and riven within by divisions of ideology and method. Recently the re-emergence of neural network models of cognition has combined with the criticisms of Hubert Dreyfus to challenge the pre-eminent position of symbolicist ideology and method within artiicial i...

متن کامل

Artiicial Intelligence: a Computational Perspective

Although the computational perspective on cognitive tasks has always played a major role in Artiicial Intelligence, the interest in the precise determination of the computational costs that are required for solving typical AI problems has grown only recently. In this paper, we will describe what insights a computational complexity analysis can provide and what methods are available to deal with...

متن کامل

Completion and Invariant Theory in Symbolic Computation and Artificial Intelligence

An outline for the study of invariant theoretic (as structural) and completion (as syntactical) concepts in symbolic computation and artiicial intelligence is presented on a level of abstraction which permits a unifying viewpoint on problems in symbolic computation and artiicial intelligence. We refer to applications in computational polynomial ideal theory and in general problem-solving in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996